From Logarithmic Advice to Single-Bit Advice
نویسندگان
چکیده
Building on Barak’s work (Random’02), Fortnow and Santhanam (FOCS’04) proved a time hierarchy for probabilistic machines with one bit of advice. Their argument is based on an implicit translation technique, which allow to translate separation results for short (say logarithmic) advice (as shown by Barak) into separations for a single-bit advice. In this note, we make this technique explicit, by introducing an adequate translation lemma.
منابع مشابه
On the Advice Complexity of the Knapsack Problem
We study the advice complexity and the random bit complexity of the online knapsack problem: Given a knapsack of unit capacity, and n items that arrive in successive time steps, an online algorithm has to decide for every item whether it gets packed into the knapsack or not. The goal is to maximize the value of the items in the knapsack without exceeding its capacity. In the model of advice com...
متن کاملAssessment of the Causes of Discharge against Medical Advice in Hospitalized Patients in Emergency Department
Abstract Introduction: When the patient discharges from the hospital against medical advice because of dissatisfaction, the treatment will not be complete and can lead to serious complications for the patient. Objective: This research is done, with the aim of reviewing the reasons of discharging against medical advice of hospitalized patients in emergency department in Razi hospital, Rasht, 2...
متن کاملNonuniform Reductions and NP-Completeness
Nonuniformity is a central concept in computational complexity with powerful connections to circuit complexity and randomness. Nonuniform reductions have been used to study the isomorphism conjecture for NP and completeness for larger complexity classes. We study the power of nonuniform reductions for NP-completeness, obtaining both separations and upper bounds for nonuniform completeness vs un...
متن کاملOne Bit of Advice
The results in this paper show that coNP is contained in NP with 1 bit of advice (denoted NP/1) if and only if the Polynomial Hierarchy (PH) collapses to D, the second level of the Boolean Hierarchy (BH). Previous work showed that BH ⊆ D =⇒ coNP ⊆ NP/poly. The stronger assumption that PH ⊆ D in the new result allows the length of the advice function to be reduced to a single bit and also makes ...
متن کاملThe online knapsack problem: Advice and randomization
We study the advice complexity and the random bit complexity of the online knapsack problem. Given a knapsack of unit capacity, and n items that arrive in successive time steps, an online algorithm has to decide for every item whether it gets packed into the knapsack or not. The goal is to maximize the value of the items in the knapsack without exceeding its capacity. In the model of advice com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره شماره
صفحات -
تاریخ انتشار 2004